أدخل كلمة أو عبارة بأي لغة 👆
اللغة:
ترجمة وتحليل الكلمات عن طريق الذكاء الاصطناعي ChatGPT
في هذه الصفحة يمكنك الحصول على تحليل مفصل لكلمة أو عبارة باستخدام أفضل تقنيات الذكاء الاصطناعي المتوفرة اليوم:
- كيف يتم استخدام الكلمة في اللغة
- تردد الكلمة
- ما إذا كانت الكلمة تستخدم في كثير من الأحيان في اللغة المنطوقة أو المكتوبة
- خيارات الترجمة إلى الروسية أو الإسبانية، على التوالي
- أمثلة على استخدام الكلمة (عدة عبارات مع الترجمة)
- أصل الكلمة
%ما هو (من)٪ 1 - تعريف
directed graph
GRAPH WITH ORIENTED EDGES
Arc (graph theory); Indegree; Directed edge (graph theory); Directed edge; Out-degree; In-degree; Weighted digraph; Simple directed graph; Source (graph theory); Sink (graph theory); Outdegree; Graph arc; Oriented Graph; Digraph (mathematics); Balanced digraph; Strongly-connected digraph; Directed cyclic graph; Underlying graph; Information sink; Directed Graph
(digraph) A graph with one-way edges.
See also directed acyclic graph.
(1994-11-11)
Directed graph
GRAPH WITH ORIENTED EDGES
Arc (graph theory); Indegree; Directed edge (graph theory); Directed edge; Out-degree; In-degree; Weighted digraph; Simple directed graph; Source (graph theory); Sink (graph theory); Outdegree; Graph arc; Oriented Graph; Digraph (mathematics); Balanced digraph; Strongly-connected digraph; Directed cyclic graph; Underlying graph; Information sink; Directed Graph
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs.
directed acyclic graph
![close relatives]] causing [[pedigree collapse]].](https://commons.wikimedia.org/wiki/Special:FilePath/EgyptianPtolemies2.jpg?width=200 "close relatives]] causing [[pedigree collapse]].")
![contracting]] each [[strongly connected component]] of the blue graph into a single yellow vertex.](https://commons.wikimedia.org/wiki/Special:FilePath/Graph Condensation.svg?width=200 "contracting]] each [[strongly connected component]] of the blue graph into a single yellow vertex.")
![A [[Hasse diagram]] representing the partial order of set inclusion (⊆) among the subsets of a three-element set](https://commons.wikimedia.org/wiki/Special:FilePath/Hasse diagram of powerset of 3.svg?width=200 "A [[Hasse diagram]] representing the partial order of set inclusion (⊆) among the subsets of a three-element set")
DIRECTED GRAPH WITH NO DIRECTED CYCLES
DAG structure; Acyclic directed graph; Acyclic digraph; Acyclic Digraph; Weisstein's conjecture; Weisstein's Conjecture; Directed Acyclic Graph; Weisstein Conjecture; Weisstein conjecture; Oriented acyclic graph; Acyclic Directed Graph; Directed acyclic graphs; Applications of directed acyclic graphs
(DAG) A directed graph containing no cycles. This means
that if there is a route from node A to node B then there is
no way back.
(1994-12-07)
ويكيبيديا
Directed graph
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs.
